Subgoal Semantics in Agent Programming

نویسندگان

  • M. Birna van Riemsdijk
  • Mehdi Dastani
  • John-Jules Ch. Meyer
چکیده

This paper investigates the notion of subgoals as used in plans in cognitive agent programming languages. These subgoals form an abstract representation of more concrete courses of action or plans. Subgoals can have a procedural interpretation (directly linked to a concrete plan) or a declarative one (the state to be reached as represented by the subgoal is taken into account). We propose a formal semantics for subgoals that interprets these declaratively, and study the relation between this semantics and the procedural subgoal semantics of the cognitive agent programming language 3APL. We prove that subgoals of 3APL can be programmed to behave declaratively, although the semantics is defined procedurally.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey

One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...

متن کامل

Weakest Preconditions and Cumulative Subgoal Fulfillment: A Comparison

We contrast the use of weakest preconditions for the correct construction of procedures with the cumulative subgoal fulfillment (CSF) approach. An example of Cohen and Monin is used for this purpose. The CSF construction process is demonstrated.

متن کامل

Improving Programming Instruction with Subgoal Labeled Instructional Text

In science, technology, engineering, and mathematics (STEM) education, problem solving tends to be highly procedural, and these procedures are typically taught with general instructional text and specific worked examples. Subgoal labels have been used in worked examples to help learners understand the procedure being demonstrated and improve problem solving performance. The effect of subgoal la...

متن کامل

A Terminating Evaluation of Logic Programs with Finite Three-Valued Models

As evaluation methods for logic programs have become more sophisticated, the classes of programs for which termination can be guaranteed have expanded. From the perspective of answer set programs that include function symbols, recent work has identified classes for which grounding routines can terminate either on the entire program [Calimeri et al. 2008] or on suitable queries [Baselice et al. ...

متن کامل

Tabled Evaluation with Delaying for General Logic Programs

The semantics of predicate logic as a programming language. Every logic program has a natural stratiication and an iterated least xed point model. Magic sets and bottom-up evaluation of well-founded models. Query restricted bottom-up evaluation of normal logic programs. Completeness of a top-down query evaluation procedure for stratiied databases. 42 LPM(PP(S j) J)(B) for some j < i and for eve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005